Universal Space–Time Codes From Demultiplexed Trellis Codes
نویسندگان
چکیده
منابع مشابه
Universal space-time codes from standard trellis codes
In the absence of accurate channel probability distribution information or in broadcast scenarios, code design for consistent channel-by-channel performance, rather than average performance, may be desirable. Root and Varaiya’s compound channel theorem promises the existence of universal codes that operate with a consistent proximity to channel mutual information on any instance of the compound...
متن کاملUniversal space-time trellis codes
This correspondence gives practical examples of space–time trellis codes performing as predicted by Root and Varaiya’s compound channel theorem. Specifically, 32-state and 64-state 2 2 space–time trellis codes are presented that provide a bit-error rate (BER) of10 on all2 2 matrix channels with an excess mutual information (MI) within 8% of the excess MI required by standard trellis codes of th...
متن کاملP 2 Codes : Pragmatic Trellis Codes Utilizing
QUAL COMM Israel. rror correction codes come in two flavors: block codes and convolutional codes. The most popular method of combining modulation and coding has been termed trellis coded modulation [ l ] (or more simply trellis codes). Pragmatic trellis codes were introduced in a previous IEEE Communications Magazine article [2] whereby the encoders and decoders for trellis codes were obtained ...
متن کاملP2 Codes: Pragmatic Trellis Codes Utilizing Punctured Convolutional Codes
In a paper [ I ] , a pragmatic approach to the design of trellis codes was described whereby the basic engine of the trellis decoder was a Viterbi Decoder for the de facto industry and government standard, rate 1/2, 64state, convolutional code. In that paper, codes for 8PSK and 16-PSK modulation were described which performed almost as well as the best trellis codes of comparable complexity (fo...
متن کاملTrellis-constrained Codes
We introduce a class of iteratively decodable trellis-constrained codes as a generalization of turbocodes, low-density parity-check codes, serially-concatenated con-volutional codes, and product codes. In a trellis-constrained code, multiple trellises interact to deene the allowed set of codewords. As a result of these interactions, the minimum-complexity single trellis for the code can have a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2006
ISSN: 0090-6778
DOI: 10.1109/tcomm.2006.873972